A Secure Frequency Computation Method over Multisets
نویسندگان
چکیده
منابع مشابه
ON GENERALIZED FUZZY MULTISETS AND THEIR USE IN COMPUTATION
An orthogonal approach to the fuzzification of both multisets and hybridsets is presented. In particular, we introduce $L$-multi-fuzzy and$L$-fuzzy hybrid sets, which are general enough and in spirit with thebasic concepts of fuzzy set theory. In addition, we study the properties ofthese structures. Also, the usefulness of these structures is examined inthe framework of mechanical multiset proc...
متن کاملSMC-MuSe: A Framework for Secure Multi-Party Computation on MultiSets
Secure Multi-Party Computation (SMC) offers a theoretically wellfounded way to enable applications that preserve their users’ privacy. However, the practical use of SMC has often been questioned in the past. This is partly due to the fact that the system assumptions made in theory are hard to meet in practice and partly due to the potentially very high overhead general purpose SMC frameworks in...
متن کاملInformation Theory over Multisets
Starting from Shannon theory of information, we present the case of producing information in the form of multisets, and encoding information using multisets. We compute the entropy of a multiset information source by constructing an equientropic string source (with interdependent symbols), and we compare this with a string information source with independent symbols. We then study the encoder a...
متن کاملDescription Logics over Multisets
Description Logics (DLs) are a family of knowledge representation languages that have gained considerable attention the last 20 years. It is wellknown that the interpretation domain of classical DLs is a classical set. However, in Science and in the ordinary life the situation is not at all like this. In order to handle these types of knowledge in DLs, in this paper we present a DL framework ba...
متن کاملSecure Centrality Computation Over Multiple Networks
Consider a multilayer graph, where the different layers correspond to different proprietary social networks on the same ground set of users. Suppose that the owners of the different networks (called hosts) are mutually non-trusting parties: how can they compute a centrality score for each of the users using all the layers, but without disclosing information about their private graphs? Under thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Korea Information and Communications Society
سال: 2014
ISSN: 1226-4717
DOI: 10.7840/kics.2014.39b.6.370